Convergence of a balancing domain decomposition by constraints and energy minimization
نویسندگان
چکیده
A convergence theory is presented for a substructuring preconditioner based on constrained energy minimization concepts. The preconditioner is formulated as an Additive Schwarz method and analyzed by building on existing results for Balancing Domain Decomposition. The main result is a bound on the condition number based on inequalities involving the matrices of the preconditioner. Estimates of the usual form C(1 + log(H/h)) are obtained under the standard assumptions of substructuring theory. Computational results demonstrating the performance of method are included.
منابع مشابه
A Nonoverlapping Domain Decomposition Preconditioner for a Symmetric Interior Penalty Method
In this talk we will discuss a nonoverlapping domain decomposition pre-conditioner for the symmetric interior penalty Galerkin method [1, 2, 3]. Thepreconditioner is based on balancing domain decomposition by constraints [4].Theoretical results on the condition number estimate of the preconditioned sys-tem will be presented along with numerical results. References[1] J. ...
متن کاملA Balancing Domain Decomposition Method by Constraints for Advection-diffusion Problems
The balancing domain decomposition methods by constraints are extended to solving nonsymmetric, positive definite linear systems resulting from the finite element discretization of advection-diffusion equations. A preconditioned GMRES iteration is used to solve a Schur complement system of equations for the subdomain interface variables. In the preconditioning step of each iteration, a partiall...
متن کاملAssembly line balancing to minimize balancing loss and system loss
Assembly Line production is one of the widely used basic principles in production system. The problem of Assembly Line Balancing deals with the distribution of activities among the workstations so that there will be maximum utilization of human resources and facilities without disturbing the work sequence. Research works reported in the literature mainly deals with minimization of idle time i.e...
متن کاملBDDC for Nonsymmetric Positive Definite and Symmetric Indefinite Problems
The balancing domain decomposition methods by constraints are extended to solving both nonsymmetric, positive definite and symmetric, indefinite linear systems. In both cases, certain nonstandard primal constraints are included in the coarse problems of BDDC algorithms to accelerate the convergence. Under the assumption that the subdomain size is small enough, a convergence rate estimate for th...
متن کاملA strongly convergent primal-dual method for nonoverlapping domain decomposition
We propose a primal-dual parallel proximal splitting method for solving domain decomposition problems for partial differential equations. The problem is formulated via minimization of energy functions on the subdomains with coupling constraints which model various properties of the solution at the interfaces. The proposed method can handle a wide range of linear and nonlinear problems, with fle...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Numerical Lin. Alg. with Applic.
دوره 10 شماره
صفحات -
تاریخ انتشار 2003